Weak-injectivity and almost perfect domains
نویسندگان
چکیده
منابع مشابه
Tilting Modules over Almost Perfect Domains
We provide a complete classification of all tilting modules and tilting classes over almost perfect domains, which generalizes the classifications of tilting modules and tilting classes over Dedekind and 1-Gorenstein domains. Assuming the APD is Noetherian, a complete classification of all cotilting modules is obtained (as duals of the tilting ones).
متن کاملSEMIGROUP ACTIONS , WEAK ALMOST PERIODICITY, AND INVARIANT MEANS
Let S be a topological semigroup acting on a topological space X. We develop the theory of (weakly) almost periodic functions on X, with respect to S, and form the (weakly) almost periodic compactifications of X and S, with respect to each other. We then consider the notion of an action of Son a Banach space, and on its dual, and after defining S-invariant means for such a space, we give a...
متن کاملSubgame Perfect Implementation With Almost Perfect Information
The theory of incomplete contracts has been recently questioned using or extending the subgame perfect implementation approach of Moore and Repullo (1988). We consider the robustness of this mechanism to the introduction of small amounts of asymmetric information. Our main result is that the mechanism may not yield (even approximately) truthful revelation as the amount of asymmetric information...
متن کاملHow Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these classical search algorithms, such as the well-known results of Pohl, Gaschnig and Pearl, suggest that such heuristic search algorithms can obtain better than exponential scaling behaviour, provided that the heuristics ...
متن کاملFinding Almost-Perfect Graph Bisections
We give a polynomial time algorithm that given a graph which admits a bisection cutting a fraction (1 − ε) of edges, finds a bisection cutting a (1 − g(ε)) fraction of edges where g(ε) → 0 as ε→ 0. One can take g(ε) = O( 3 √ ε log(1/ε)). Previously known algorithms for Max Bisection could only guarantee finding a bisection that cuts a fraction of edges bounded away from 1 (in fact less than 3/4...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2009
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2008.08.033